Short-distance information from B(KL→μ+μ−)

Extracting short distance information from b ! s‘ ‘ effectively

Keith S. M. Lee, Zoltan Ligeti, Iain W. Stewart, and Frank J. Tackmann California Institute of Technology, Pasadena, California 91125, USA Ernest Orlando Lawrence Berkeley National Laboratory, University of California, Berkeley, California 94720, USA Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA (Received 21 December 2006; published 2...

Euclidean Distance Reconstruction from Partial Distance Information

Euclidean distance matrix completion problem aims at reconstructing the low dimensional geometry structure of nodes given only a few pairwise distances between nodes [1]. This problem arises in many applications including networks and machine learning where much information of points is laking. For instance, in sensor networks, due to the constraints of energy and communication radius, sensor n...

Three short distance structures from quantum algebras

We review known and we present new results on three types of short distance structures of observables which typically appear in studies of quantum group related algebras. In particular, one of the short distance structures is shown to suggest a new mechanism for the introduction of internal symmetries. DAMTP/97-100 q-alg/9709023

Relations between Renyi Distance and Fisher Information

In this paper, we first show that Renyi distance between any member of a parametric family and its perturbations, is proportional to its Fisher information. We, then, prove some relations between the Renyi distance of two distributions and the Fisher information of their exponentially twisted family of densities. Finally, we show that the partial ordering of families induced by Renyi dis...

Can we extract short – distance information from B ( K L → μ + μ − ) ?